Electronegativity scheme for reactions involving radical addition to vinyl monomers

The concept of the apparent electronegativity of a reaction site has been introduced. This has been used to develop a new scheme for calculating the relative rate constants of addition of radicals with different structures to vinyl monomers. The parameters of the scheme are given for 40 reagents. The results of a comparison of calculated and literature rate constants of addition are presented.Institute of Nonaqueous Solution Chemistry, Russian Academy of Sciences, 150003 Ivanovo. Translated from Izvestiya Akademii Nauk, Seriya Khimicheskaya, No. 10, pp. 2238–2245, October, 1992.     

Assessment of some iterative methods for non-symmetric linear systems arising in computational fluid dynamics

Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme.     

Implementation of some higher-order convection schemes on non-uniform grids

A generalized formulation is applied to implement the quadratic upstream interpolation (QUICK) scheme, the second-order upwind (SOU) scheme and the second-order hybrid scheme (SHYBRID) on non-uniform grids. The implementation method is simple. The accuracy and efficiency of these higher-order schemes on non-uniform grids are assessed. Three well-known bench mark convection-diffusion problems and a fluid flow problem are revisited using non-uniform grids. These are: (1) transport of a scalar tracer by a uniform velocity field; (2) heat transport in a recirculating flow; (3) two-dimensional non-linear Burgers equations; and (4) a two-dimensional incompressible Navier-Stokes flow which is similar to the classical lid-driven cavity flow. The known exact solutions of the last three problems make it possible to thoroughly evaluate accuracies of various uniform and non-uniform grids. Higher accuracy is obtained for fewer grid points on non-uniform grids. The order of accuracy of the examined schemes is maintained for some tested problems if the distribution of non-uniform grid points is properly chosen.     

Case of a Boltzmann gas leading to the Smoluchowski coagulation equation

A special model of a rarefied hard-sphere gas is considered. The hard-sphere particles undergo absolutely elastic collisions. It is assumed that particles can collide only if their nonzero velocities are orthogonal to each other. The model makes it possible to proceed from the Boltzmann equation to the Smoluchowski coagulation equation, where coagulation means that the kinetic energies of the colliding particles are added. A Monte Carlo scheme for simulation of the phenomenon is described, and the convergence of the simulation algorithm is proved. The convergence of numerical results to exact solutions of the Smoluchowski equation and to finite-difference solutions is tested.     

A Relaxation Scheme for Solving the Boltzmann Equation Based on the Chapman-Enskog Expansion

Abstract In [16] a visco-elastic relaxation system, called the relaxed Burnett system, was proposed by Jinand Slemrod as a moment approximation to the Boltzmann equation. The relaxed Burnett system is weaklyparabolic, has a linearly hyperbolic convection part, and is endowed with a generalized eotropy inequality. Itagrees with the solution of the Boltzmann equation up to the Burnett order via the Chapman-Enskog expansion. We develop a one-dimensional non-oscillatory numerical scheme based on the relaxed Burnett system forthe Boltzmann equation. We compare numerical results for stationary shocks based on this relaxation scheme,and those obtained by the DSMC (Direct Simulation Monte Carlo), by the Navier-Stokes equations and bythe extended thermodynamics with thirteen moments (the Grad equations). Our numerical experiments showthat the relaxed Burnett gives more accurate approximations to the shock profiles of the Boltzmann equationobtained by the DSMC, for a range of Mach numbers for hypersonic flows, th     

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure

In a secret sharing scheme, some participants can lie about the value of their shares when reconstructing the secret in order to obtain some illicit benefit. We present in this paper two methods to modify any linear secret sharing scheme in order to obtain schemes that are unconditionally secure against that kind of attack. The schemes obtained by the first method are robust, that is, cheaters are detected with high probability even if they know the value of the secret. The second method provides secure schemes, in which cheaters that do not know the secret are detected with high probability. When applied to ideal linear secret sharing schemes, our methods provide robust and secure schemes whose relation between the probability of cheating and the information rate is almost optimal. Besides, those methods make it possible to construct robust and secure schemes for any access structure.     

带跳的非线性随机微分方程的Lyapunov指数的估计

本文研究了带跳的非线性随机微分方程Lyapunov指数的估计,在适当的条件下,确定其Lyapunov指数q的值．对于给定的步长h,考虑此微分系统的Euler离散化模型,给出了的理论误差估计.     

Higher-order implicit strong numerical schemes for stochastic differential equations

Higher-order implicit numerical methods which are suitable for stiff stochastic differential equations are proposed. These are based on a stochastic Taylor expansion and converge strongly to the corresponding solution of the stochastic differential equation as the time step size converges to zero. The regions of absolute stability of these implicit and related explicit methods are also examined.     

Fully adaptive multiresolution finite volume schemes for conservation laws

The use of multiresolution decompositions in the context of finite volume schemes for conservation laws was first proposed by A. Harten for the purpose of accelerating the evaluation of numerical fluxes through an adaptive computation. In this approach the solution is still represented at each time step on the finest grid, resulting in an inherent limitation of the potential gain in memory space and computational time. The present paper is concerned with the development and the numerical analysis of fully adaptive multiresolution schemes, in which the solution is represented and computed in a dynamically evolved adaptive grid. A crucial problem is then the accurate computation of the flux without the full knowledge of fine grid cell averages. Several solutions to this problem are proposed, analyzed, and compared in terms of accuracy and complexity.

     

A Representation of a Family of Secret Sharing Matroids

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing